Abstract 15

15-851 Project Report: Refinement Type Inference using Abstract Interpretation

Typing checking is an efficient way to catch simple errors. Refinement types [3] are invented to take advantage of type systems in specifying more program properties and verifying them through type checking. In [3, 2], a method to use rectype declaration has been proposed to specify regular tree grammar based invariants. Datatype lattices are then derived from rectype declarations. An algorithm...

Notes on Abstract Syntax 15 - 312 : Foundations of Programming Languages

Syntax L3.3 k nat num(k) expr t1 expr t2 expr plus(t1, t2) expr t1 expr t2 expr times(t1, t2) expr Now we specify the proper relation between concrete and abstract syntax through several simultaneously inductive judgments. Perhaps the easiest way to generate these judgments is to add the corresponding abstract syntax terms to each of the inference rules defining the concrete syntax. 0 D←→ 0 nat...

abstract

ABSTRACT

Abstract

Abstract